A Locally Correctable B-Tree Implementation
نویسندگان
چکیده
منابع مشابه
Relaxed Locally Correctable Codes
Locally decodable codes (LDCs) and locally correctable codes (LCCs) are error-correcting codes in which individual bits of the message and codeword, respectively, can be recovered by querying only few bits from a noisy codeword. These codes have found numerous applications both in theory and in practice. A natural relaxation of LDCs, introduced by Ben-Sasson et al. (SICOMP, 2006), allows the de...
متن کاملLocally Correctable and Testable Codes Approaching the Singleton Bound
Locally-correctable codes (LCCs) and locally-testable codes (LTCs) are codes that admit local algorithms for decoding and testing respectively. The local algorithms are randomized algorithms that make only a small number of queries to their input. LCCs and LTCs are both interesting in their own right, and have important applications in complexity theory. It is a well-known question what are the...
متن کاملRelaxed Locally Correctable Codes in Computationally Bounded Channels
Error-correcting codes that admit local decoding and correcting algorithms have been the focus of much recent research due to their numerous theoretical and practical applications. The goal is to obtain the best possible tradeoffs between the number of queries the algorithm makes to its oracle (the locality of the task), and the amount of redundancy in the encoding (the information rate). In Ha...
متن کاملLocally Testable and Locally Correctable Codes Approaching the Gilbert-Varshamov Bound
One of the most important open problems in the theory of error-correcting codes is to determine the tradeoff between the rate R and minimum distance δ of a binary code. The best known tradeoff is the Gilbert-Varshamov bound, and says that for every δ ∈ (0, 1/2), there are codes with minimum distance δ and rate R = RGV(δ) > 0 (for a certain simple function RGV(·)). In this paper we show that the...
متن کاملImplementation and Evaluation of String B-Tree
String B-tree is a combination of B-tree and Patricia tries for internal-node indices. Instead of storing prefix compressed keys at each index node, each key is stored in full in a consecutive sequence of data blocks, and each downward-traversal decision is made by a combination of Patricia trie search and the consultation of a single key. String B-tree has the same worst case performance as B-...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: The Computer Journal
سال: 1986
ISSN: 0010-4620,1460-2067
DOI: 10.1093/comjnl/29.3.269